Removing the Barrier to Scalability in Parallel FMM

نویسنده

  • Matthew G. Knepley
چکیده

The Fast Multipole Method (FMM) is well known to possess a bottleneck arising from decreasing workload on higher levels of the FMM tree [Greengard and Gropp, Comp. Math. Appl., 20(7), 1990]. We show that this potential bottleneck can be eliminated by overlapping multipole and local expansion computations with direct kernel evaluations on the finest level grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation

We present an efficient and provably good partitioning and load balancing algorithm for parallel adaptive N-body simulation. The main ingredient of our method is a novel geometric characterization of a class of communication graphs that can be used to support hierarchical N-body methods such as the fast multipole method (FMM) and the Barnes–Hut method (BH). We show that communication graphs of ...

متن کامل

A tuned and scalable fast multipole method as a preeminent algorithm for exascale systems

Among the algorithms that are likely to play a major role in future exascale computing, the fast multipole method (FMM) appears as a rising star. Our previous recent work showed scaling of an FMM on GPU clusters, with problem sizes in the order of billions of unknowns. That work led to an extremely parallel FMM, scaling to thousands of GPUs or tens of thousands of CPUs. This paper reports on a ...

متن کامل

PVFMM: A parallel kernel independent FMM for particle and volume potentials

We describe our implementation of a parallel fast multipole method for evaluating potentials for discrete and continuous source distributions. The first requires summation over the source points and the second requiring integration over a continuous source density. Both problems require O(N2) complexity when computed directly; however, can be accelerated toO(N) time using FMM. In our PVFMM soft...

متن کامل

PetFMM--A dynamically load-balancing parallel fast multipole library

Fast algorithms for the computation of N -body problems can be broadly classified into mesh-based interpolation methods, and hierarchical or multiresolution methods. To this last class belongs the well-known fast multipole method (fmm), which offers O(N) complexity. The fmm is a complex algorithm, and the programming difficulty associated with it has arguably diminished its impact, being a barr...

متن کامل

کاربرد سطوح پخش کننده در افزایش راندمان آکوستیکی مانع های موازی شیب دار T شکل

Background and aimsThe paper presents the results of an investigation on the acoustic  performance of tilted profile parallel barriers with quadratic residue diffuser tops and faces.MethodsA2D boundary element method (BEM) is used to predict the barrier insertion loss. The results of rigid and with absorptive coverage are also calculated for comparisons. Using QRD on the top surface and faces o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1008.2410  شماره 

صفحات  -

تاریخ انتشار 2010